A correlative denoising autoencoder to model social influence for top-N recommender system
نویسندگان
چکیده
منابع مشابه
Top-N Recommender System via Matrix Completion
Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. To do that, a nonconvex rank relaxation rather than the nuclear norm is adopte...
متن کاملA social influence based trust model for recommender systems
Trustworthy computing has recently attracted significant interest from researchers in several fields including multi-agent systems, social network analysis, and recommender systems. As an additional dimension of information to past rating history, trust has been shown to be helpful for improving the accuracy of recommendations. Studies on the relationship between trust and rating behaviors may ...
متن کاملEnsemble-based Top-k Recommender System Considering Incomplete Data
Recommender systems have been widely used in e-commerce applications. They are a subclass of information filtering system, used to either predict whether a user will prefer an item (prediction problem) or identify a set of k items that will be user-interest (Top-k recommendation problem). Demanding sufficient ratings to make robust predictions and suggesting qualified recommendations are two si...
متن کاملDesigning a trust-based recommender system in Social Rating Networks
One of the most common styles of business today is electronic business, since it is considered as a principal mean for financial transactions among advanced countries. In view of the fact that due to the evolution of human knowledge and the increase of expectations following that, traditional marketing in electronic business cannot meet current generation’s needs, in order to survive, organizat...
متن کاملA Denoising Autoencoder that Guides Stochastic Search
An algorithm is described that adaptively learns a non-linear mutation distribution. It works by training a denoising autoencoder (DA) online at each generation of a genetic algorithm to reconstruct a slowly decaying memory of the best genotypes so far. A compressed hidden layer forces the autoencoder to learn hidden features in the training set that can be used to accelerate search on novel pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Computer Science
سال: 2019
ISSN: 2095-2228,2095-2236
DOI: 10.1007/s11704-019-8123-3